package LeetCode热题HOT100;

import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class p139单词拆分 {
    public boolean wordBreak(String s, List<String> wordDict) {
        //动态规划
        Set<String> set=new HashSet<>(wordDict);
        boolean[] dp=new boolean[s.length()+1];//dp[0]作为边界条件
        dp[0]=true;

        for (int i = 1; i <= s.length() ; i++) {
            for (int j = 0; j <i ; j++) {
                if (dp[j] && set.contains(s.substring(j,i))) {
                    dp[i]=true;
                    break;
                }
            }
        }
        return dp[s.length()];
    }
}
